Asymptotics of combinatorial structures with large smallest component
نویسندگان
چکیده
We study the probability of connectedness for structures of size n when all components must have size at least m: In the border between almost certain connectedness and almost certain disconnectedness, we encounter a generalized Buchstab function of n=m: r 2004 Elsevier Inc. All rights reserved.
منابع مشابه
Asymptotics of Smallest Component Sizes in Decomposable Combinatorial Structures of Alg-Log Type
when z is near the dominant singularity ρ. We provide asymptotic results about the size of the smallest components in random combinatorial structures for the cases 0 < α < 1 and any β, and α < 0 and β = 0. The particular case α = 0 and β = 1, the so-called exp-log class, has been treated in previous papers. We also provide similar asymptotic estimates for combinatorial objects with a restricted...
متن کاملThe Size of the rth Smallest Component in Decomposable Structures with a Restricted Pattern
In our previous work (2), we derived an asymptotic expression for the probability that a random de-composable combinatorial structure of size n in the exp-log class has a given restricted pattern. In this paper, under similar conditions, we provide the probability that a random decomposable combinatorial structure has a given restricted pattern and the size of its rth smallest component is bigg...
متن کاملAssessment of "drug-likeness" of a small library of natural products using chemoinformatics
Even though natural products has an excellent record as a source for new drugs, the advent of ultrahigh-throughput screening and large-scale combinatorial synthetic methods, has caused a decline in the use of natural products research in the pharmaceutical industry. This is due to the efficiency in generating and screening a high number of synthetic combinatorial compounds; whereas traditional ...
متن کاملAssessment of "drug-likeness" of a small library of natural products using chemoinformatics
Even though natural products has an excellent record as a source for new drugs, the advent of ultrahigh-throughput screening and large-scale combinatorial synthetic methods, has caused a decline in the use of natural products research in the pharmaceutical industry. This is due to the efficiency in generating and screening a high number of synthetic combinatorial compounds; whereas traditional ...
متن کاملAsymptotics of counts of small components in random combinatorial structures and models of coagulation -fragmentation
We establish necessary and sufficient conditions for convergence of non scaled multiplicative measures on the set of partitions. The measures depict component spectrums of random structures and the equilibrium of some models of statistical mechanics, including stochastic processes of coagulationfragmentation. Based on the above result, we show that the common belief that interacting groups in m...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- J. Comb. Theory, Ser. A
دوره 107 شماره
صفحات -
تاریخ انتشار 2004